A gHull: a GPU Algorithm for 3D Convex Hull
نویسندگان
چکیده
A novel algorithm is presented to compute the convex hull of a point set in R3 using the graphics processing unit (GPU). By exploiting the relationship between the Voronoi diagram and the convex hull, the algorithm derives the approximation of the convex hull from the former. The other extreme vertices of the convex hull are then found by using a two-round checking in the digital and the continuous space successively. The algorithm does not need explicit locking or any other concurrency control mechanism, thus it can maximize the parallelism available on the modern GPU.
منابع مشابه
A 3D Convex Hull Algorithm for Graphics Hardware
This report presents a novel approach, termed gHull, to compute the convex hull for a given point set inR using the graphics processing units (GPUs). While the 2D problem can easily and efficiently be solved in the GPU, there is no known obvious, classical parallel solution that works well in the GPU for the 3D problem. Our novel parallel approach exploits the relationship between the 3D Vorono...
متن کاملNATIONAL UNIVERSITY OF SINGAPORE School of Computing PH.D DEFENCE - PUBLIC SEMINAR
This thesis studies transformation between geometric structures via geometric operations that act on some simplices of a geometric structure. Such a transformation is termed local transformation as an operation utilizes only information local to some neighboring simplices but nothing about other attributes or configurations global in nature to the structure. One famous algorithm of local transf...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملFinding Convex Hulls Using Quickhull on the GPU
We present a convex hull algorithm that is accelerated on commodity graphics hardware. We analyze and identify the hurdles of writing a recursive divide and conquer algorithm on the GPU and divise a framework for representing this class of problems. Our framework transforms the recursive splitting step into a permutation step that is well-suited for graphics hardware. Our convex hull algorithm ...
متن کاملGPU accelerated convex hull computation
We present a hybrid algorithm to compute the convex hull of points in three or higher dimensional spaces. Our formulation uses a GPU-based interior point filter to cull away many of the points that do not lie on the boundary. The convex hull of remaining points is computed on a CPU. The GPU-based filter proceeds in an incremental manner and computes a pseudo-hull that is contained inside the co...
متن کامل